Constructions of the reduced product type—II
نویسندگان
چکیده
منابع مشابه
ReinforcementThing of TypeII FuzzySystems
A type II fuzzy system is refined by a reinforcement learning scheme in this paper. By tuning the parameters of the type II fuzzy controller, we demonstrate that reinforcement learning can help to achieve good performance. Results from the pole-balancing problem are given with comparisons of different fuzzy control schemes. It is shown that the learned type II fuzzy controller can achieve goals...
متن کاملConstructions for Modeling Product Structure
This paper identifies constructions needed for modeling product structure, shows which ones can be represented in OWL2 and suggests extensions for those that do not have OWL2 representations. A simplified mobile robot specification is formalized as a Knowledge Base (KB) in an extended logic. A KB is constructed from a signature of types (classes), typed properties, and typed variables and opera...
متن کاملForbidden Configurations and Product Constructions
A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix F , we define that a (0,1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let |A| denote the number of columns of A. We define forb(m,F ) = max{|A| : A is m-rowed simple matrix and has no configuration F}....
متن کاملthe verbal constructions in azari (harzani dialect)
most of the verbal constructions of harzani dialect have got inflectional affixes. the majority of the constructions are made up vy adding a specific verbal affix to the verbal stem (infinitive without infinitive marker). only a few number of them is formed by adding a verbal affix to the past participle of the verb. there are specific rules for the formation of different verbal types. there is...
15 صفحه اولProduct constructions for transitive decompositions of graphs
A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 1965
ISSN: 0040-9383
DOI: 10.1016/0040-9383(65)90070-4